Traffic grooming is a major issue in optical networks. It refers to groupinglow rate signals into higher speed streams, in order to reduce the equipmentcost. In SONET WDM networks, this cost is mostly given by the number ofelectronic terminations, namely ADMs. We consider the case when the topology isa unidirectional ring. In graph-theoretical terms, the traffic grooming problemin this case consists in partitioning the edges of a request graph intosubgraphs with a maximum number of edges, while minimizing the total number ofvertices of the decomposition. We consider the case when the request graph hasbounded maximum degree $\Delta$, and our aim is to design a network being ableto support any request graph satisfying the degree constraints. The existingtheoretical models in the literature are much more rigid, and do not allow suchadaptability. We formalize the problem, and solve the cases $\Delta=2$ (for allvalues of $C$) and $\Delta = 3$ (except the case C=4). We also provide lowerand upper bounds for the general case.
展开▼
